Algorithm for Recognizing Cartesian Graph Bundles

نویسندگان

  • Blaz Zmazek
  • Janez Zerovnik
چکیده

Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that ÿnds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is deÿned and it is shown that any equivalence relation possessing the unique square property determines the fundamental factorization of a graph as a nontrivial Cartesian graph bundle over arbitrary base graph. In this paper we deÿne a relation having a unique square property on Cartesian graph bundles over K 4\e-free simple base. We also give a polynomial algorithm for recognizing Cartesian graph bundles over K 4\e-free simple base.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognizing Cartesian graph bundles

Graph bundles generalize the notion of covering graphs and graph products. In this paper we extend some of the methods for recognizing Cartesian product graphs to graph bundles. Two main notions are used. The first one is the well-known equivalence relation δ defined on the edge-set of a graph. The second one is the concept of k-convex subgraphs. A subgraph H is k-convex in G, if for any two ve...

متن کامل

Recognizing weighted directed cartesian graph bundles

In this paper we show that methods for recognizing Cartesian graph bundles can be generalized to weighted digraphs. The main result is an algorithm which lists the sets of degenerate arcs for all representations of digraph as a weighted directed Cartesian graph bundle over simple base digraphs not containing transitive tournament on three vertices. Two main notions are used. The first one is th...

متن کامل

Unique square property and fundamental factorizations of graph bundles

Graph bundles generalize the notion of covering graphs and graph products. In Imrich et al. (Discrete Math. 167=168 (1998) 393) authors constructed an algorithm that 5nds a presentation as a nontrivial cartesian graph bundle for all graphs that are cartesian graph bundles over triangle-free simple base using the relation ∗ having the square property. An equivalence relation R on the edge set of...

متن کامل

On domination numbers of graph bundles

Let γ(G) be the domination number of a graph G. It is shown that for any k ≥ 0 there exists a Cartesian graph bundle B φF such that γ(B φF ) = γ(B)γ(F )−2k. The domination numbers of Cartesian bundles of two cycles are determined exactly when the fibre graph is a triangle or a square. A statement similar to Vizing’s conjecture on strong graph bundles is shown not to be true by proving the inequ...

متن کامل

Fast Recognition of Partial Star Products and Quasi Cartesian Products

This paper is concerned with the fast computation of a relation d on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the recognition of Cartesian graph bundles with a triangle free basis. A special case of d is the relation δ, whose convex closure yields the product relation σ th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Notes in Discrete Mathematics

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1999